The Complexity of Permutive Cellular Automata
نویسندگان
چکیده
This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are given in closed forms and Parry measure is demonstrated to be an equilibrium measure for some potential function. For topological aspect, an example is examined to show that the exhibition of snap-back repellers for a cellular automaton infers Li-Yorke chaos. In addition, bipermutive cellular automata are optimized for the exhibition of snap-back repellers in permutive cellular automata whenever two-sided shift space is considered.
منابع مشابه
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups
The decidability of the niteness problem for automaton groups is a well-studied open question on Mealy automata. We connect this question of algebraic nature to the periodicity problem of one-way cellular automata, a dynamical question known to be undecidable in the general case. We provide a rst undecidability result on the dynamics of one-way permutive cellular automata, arguing in favor of t...
متن کاملPeriodic Points and Entropies for Cellular Automata
For the class of permutive cellular automata the number of periodic points and the topological and metrical entropies are calculated.
متن کاملRemarks on permutive cellular automata
We prove that every n-dimensional permutive cellular automaton is conjugate to a one-sided shift with compact set of states. This is a generalization of a theorem of R. Gilman.
متن کاملCommuting Cellular Automata
The algebraic conditions under which two one-dimensional cellular automata can commute is studied. It is shown that if either rule is permutive, that is, one-to-one in its leftmost and rightmost inputs, then the other rule can be written in terms of it; if either rule is a group, then the other is linear in it; and if either is permutive and affine, that is, linear up to a constant, then the ot...
متن کاملTwo Novel D-Flip Flops with Level Triggered Reset in Quantum Dot Cellular Automata Technology
Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Cellular Automata
دوره 6 شماره
صفحات -
تاریخ انتشار 2011